A confluent calculus for concurrent constraint programming
نویسندگان
چکیده
منابع مشابه
A Confluent Calculus for Concurrent Constraint Programming with Guarded Choice
Connuence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings. Unfortunately , the usual operational semantics for concurrent constraint programs is not connuent as diierent process schedulings give rise to diierent sets of possible outcomes. We show that it is possib...
متن کاملA Temporal Concurrent Constraint Programming Calculus
The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and non-deterministic timed behavior. We call this tcc extension the ntcc calculus. The expressiveness of ntcc is illustrated by modeling cells, asynchronous bounded broadcasting and ...
متن کاملA Confluent Relational Calculus for Higher-Order Programming with Constraints
We present the-calculus, a relational calculus parametrized with a logical constraint system. The-calculus provides for higher-order relational programming with rst-order constraints, and subsumes higher-order functional programming as a special case. It captures important aspects of the concurrent constraint programming language Oz. We prove the uniform connuence of the-calculus. Uniform connu...
متن کاملModels for Concurrent Constraint Programming
Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas:concurrency(multiple agents are simultaneouslyactive), communication (they interact via the monotonic accumulation of constraints on shared variables), coordination (the presence or absence of information can guard evolution of an agent), and localization (each agenthas a...
متن کاملTruly Concurrent Constraint Programming
We study “causality” relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for cc that is fully-abstract with respect to observing this “causality” relation on constraints. This semantics preserves more fine-grained st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00196-x